Binary and ternary quasi-perfect codes with small dimensions
نویسندگان
چکیده
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of infinite families of QP codes which includes all binary, ternary and quaternary codes known to is. We continue further with a list of sporadic examples of binary and ternary QP codes. Later we present the results of our investigation where binary QP codes of dimensions up to 14 and ternary QP codes of dimensions up to 13 are classified.
منابع مشابه
A family of ternary quasi-perfect BCH codes
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
متن کاملA family of constacyclic ternary quasi-perfect codes with covering radius 3
In this paper a family of constacyclic ternary quasi-perfect linear block codes is presented. This family extends the result presented in a previous work by the first two authors, where the existence of codes with the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3.
متن کاملOn diameter perfect constant-weight ternary codes
From cosets of binary Hamming codes we construct diameter perfect constantweight ternary codes with weight n − 1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.
متن کاملThe Category of Linear Codes
| In the late 50s Slepian introduced a structure theory for linear, binary codes and proved that every such code was uniquely the sum of indecomposable codes. He had hoped to produce a canonical form for the generator matrix of an indecompos-able code so that he might read oo the properties of the code from such a matrix, but such a program proved impossible. We here work over an arbitrary eld ...
متن کاملThe poset structures admitting the extended binary Golay code to be a perfect code
Brualdi et al. [Codes with a poset metric, Discrete Math. 147 (1995) 57–72] introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Golay code to be a 4-error-correcting perfect P-code. In this paper we classify all of the poset structures which admit the extended binary Golay code to be a 4-error-correcting perfect P-code, and show that th...
متن کامل